Compiling with Continuations

نویسنده

  • Andrew W. Appel
چکیده

Cambridge University Press has no responsibility for the persistence or accuracy of URLs for external or third-party Internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compiling ATL with Continuations

This paper presents a proposal to use continuations as an implementation mechanism for ATL. We introduce the notion of continuation, showing its applicability to model-to-model transformations, and develop a simple mechanism to enable continuations in model transformations. Then, the declarative part of ATL is mapped to this mechanism.

متن کامل

Compiling with continuations

This paper describes the Orbit Scheme optimizing compiler. Orbit was one of the first practical compilers for Scheme, whereas most existing Scheme compilers at the time were research prototypes. The paper walks us through the phases of the compiler, explaining design decisions along the way. The result of this research is a production-quality Scheme compiler. It generates code that is competiti...

متن کامل

No Assembly Required : Compiling Standard ML

C has been used as a portable target language for implementing languages like Standard ML and Scheme. Previous eeorts at compiling these languages to C have produced eecient code, but also compromised on portability and proper tail-recursion. We show how to compile Standard ML to C without making such compromises. The compilation technique is based on converting Standard ML to a continuation-pa...

متن کامل

An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in Fopc

This brief historical note describes research which was done in the period 1970-1973, and where continuations were introduced in a fairly pragmatic way together with partial evaluation in order to compile \rules" expressed as statements in rst-order predicate calculus. The methods used at that time were quite straightforward , but they may be of some interest for the present workshop as an \ear...

متن کامل

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation

We illustrate a simple and effective solution to semantics-based compiling. Our solution is based on type-directed partial evaluation, where • our compiler generator is expressed in a few lines, and is efficient; • its input is a well-typed, purely functional definitional interpreter in the manner of denotational semantics; • the output of the generated compiler is three-address code, in the fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992